Programming by Analogous

نویسنده

  • Corrina Perrone
چکیده

manipulate the sources or their information, such as the location of their files on a haed drive or the emails in their in-boxes. End-user programming is emerging as a crucial instrument in the daily informationprocessing struggle [8]. Such programming allows customized personal information processing. But few end users have the background, motivation, or time to use traditional programming approaches or the means to hire professional programmers to create programs for them. Simple forms of end-user programming include email filters to clean up email by directing specified emails into separate folders and spreadsheets to explore, say, the total cost of a new house. Programming by example (PBE) is a powerful end-user-programming paradigm enabling users without formal training in programming to create sophisticated programs. PBE environments create programs for end users by observing and recording software behaviors as they manipulate information on the graphical user interface (GUI) level. For example, in Microsoft Word, PBE mechanisms allow users to build macros. Here, we explore the problem of PBE reuse, or how users can reuse old program behavior. A user might find a PBE-generated program useful but may need to either generalize or modify it for a related but different task. Program reuse is a well-known software

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OPTIMALITY CONDITIONS FOR NONCONVEXSEMIDEFINITE PROGRAMMINGAnders

This paper concerns nonlinear semideenite programming problems for which no convexity assumptions can be made. We derive rst-and second-order op-timality conditions analogous to those for nonlinear programming. Using techniques analogous to those used in nonlinear programming, we extend existing theory to cover situations where strict complementarity does not hold and the constraint matrix is s...

متن کامل

A New Heterogeneous Nanocatalyst for Sulfoxidation of Sulfids to Corresponding Adrafinil Analogous: Synthesis, Properties and Applications of VO3-/NH3+-SiO2/Fe3O4

A new magnetic nanocatalyst has been prepared using immobilization of vanadate onto aminopropyl functionalized SiO2/Fe3O4(VO3-/NH3+-SiO2/Fe3O4). The obtained magnetic catalyst was characterized by FT-IR, XRD, VSM and SEM techniques and used for sulfoxidation of sulfide compounds to the correspondingsulfoxides in presence of H2O2 as oxidant at room temperature. The optimum of reaction conditions...

متن کامل

Limits to Expression in Genetic Programming: Lattice-Aggregate Modeling

This paper describes a general theoretical model of size and shape evolution in genetic programming. The proposed model incorporates a mechanism that is analogous to ballistic accretion in physics. The model indicates a four-region partition of GP search space. It further suggests that two of these regions are not searchable by GP.

متن کامل

DFT Study and NBO Analysis of Conformation Properties of 2,5,5-Trimethyl-1,3,2-Dioxaphosphinane 2-Selenide and Their Dithia and Diselena Analogous

The hybrid density functional theory (B3LYP) and ab initio molecular orbital (HF) based methods and Natural Bond Orbital (NBO) interpretation were used to analyze the conformational behaviors of 2,5,5-trimethyl-1,3,2-dioxaphosphinane 2-selenide (compound 1), 2,5,5-trimethyl-1,3,2-dithiaphosphinane 2-selenide (compound 2) and 2,5,5-trimethyl-1,3,2-diselena phosp...

متن کامل

Synthesis of Some New Enaminoketones, Analogous of Milrinone, 4,Pyrones and Related 4-Pyridones

Synthesis of 4-(N,N- dimethylamino)-3-aryl-3-butene-2-one, ethyl-5-aryl-4-oxo-4H-pyran-2-carboxylate, ethyl-5-aryl-4-pyridones-2-carboxylate and 5-aryl-3-cyano-5-methyl-2-pyridones (aryl=3-thienyl, 2-furyl) are described.

متن کامل

An integer programming proof of Cook’s theorem of NP-completeness

The theory of NP-completeness has its roots in a foundational result by Cook, who showed that Boolean satisfiability (SAT) is NP-complete and thus unlikely to admit an efficient solution. We prove an analogous result using binary integer programming in the place of SAT. The proof gives deeper insight into the theory of NP-completeness to operations researchers for whom the language of integer p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000